package leetcode.D400.T310;

import java.util.List;

public class M310 {
    public static void main(String[] args) {
        int n = 6;
        int[][] edges = new int[][] {{3, 0}, {3, 1}, {3, 2}, {3, 4}, {5, 4}};
        List<Integer> minHeightTrees = new Solution().findMinHeightTrees(n, edges);
        for (Integer minHeightTree : minHeightTrees) {
            System.out.println(minHeightTree);
        }
    }
}
